A modified branch and bound algorithm for a vague flow-shop scheduling problem
Authors
Abstract:
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on distance is used to model a flow-shop scheduling problem being an important problem in assembly production systems. The vagueness being used as octagon numbers are employed to represent vague processes for the manufacturing system. As a modeling effort, first a flow-shop scheduling problem is handled with vagueness. Then, for solving and analyzing the proposed vague flow-shop scheduling model, a modified Branch and Bound algorithm is proposed. As an implementation, an example is used to explain the performance and to analyze the sensitivity of the proposed vague approach. The validity of the proposed model and modified algorithm is demonstrated through a robust ranking technique. The outputs help the decision makers to counteract the vagueness and handle operational decisions in flow-shop scheduling problems within dynamic environments.
similar resources
Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
full textA multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
full textA Branch & Bound Algorithm for the Open-shop Problem
A fast branch & bound method for the open-shop problem based on a disjunctive graph formulation of the problem is developed. Computational results show that the method yields excellent results. Some benchmark problems from the literature were solved to optimality for the first time.
full textTwo Stage Flow Shop Scheduling Problem Including Transportation Time and Weightage of Jobs with Branch and Bound Method
full text
A Branch and Bound Algorithm for the Job-Shop Scheduling Problem
A fast branch and bound algorithm for the job-shop scheduling problem has been developed. Among other hard problems it solves the 10 x 10 benchmark problem which has been open for more than 20 years. We will give a complete description of this algorithm and will present computational results.
full textParallel branch-and-bound methods for thejob-shop scheduling problem
Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of N P -complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to...
full textMy Resources
Journal title
volume 16 issue 4
pages 55- 64
publication date 2019-08-20
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023